Reducing the Complexity of Iterative Post-processing of Video

نویسندگان

  • Mark A. Robertson
  • Robert L. Stevenson
چکیده

We propose a method of reducing the computational complexity of iterative video post-processing algorithms that make use of the convex quantization constraint set. Rather than constraining all DCT coefficients in a block, this method constrains only a subset of a block’s DCT coefficients, and hence eliminates the need to evaluate all coefficients.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compressed Domain Scene Change Detection Based on Transform Units Distribution in High Efficiency Video Coding Standard

Scene change detection plays an important role in a number of video applications, including video indexing, searching, browsing, semantic features extraction, and, in general, pre-processing and post-processing operations. Several scene change detection methods have been proposed in different coding standards. Most of them use fixed thresholds for the similarity metrics to determine if there wa...

متن کامل

Reducing the Computational Complexity of a Map Post-Processing Algorithm for Video Sequences

Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts in images [2]. Unfortunately, this MAP formulation requires iterative techniques for the solution of a constrained optimization problem. In the past, these iterative techniques have been computationally intensive, makin...

متن کامل

Reducing the Complexity of Iterativepost - Processing Of

POST-PROCESSING OF VIDEO Mark A. Robertson and Robert L. Stevenson Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556 fmrobert2,[email protected] ABSTRACT We propose a method of reducing the computational complexity of iterative video post-processing algorithms that make use of the convex quantization constraint set. Rather than constraining all DCT coe cients in a blo...

متن کامل

Application of iterative Jacobi method for an anisotropic diusion in image processing

Image restoration has been an active research area. Dierent formulations are eective in high qualityrecovery. Partial Dierential Equations (PDEs) have become an important tool in image processingand analysis. One of the earliest models based on PDEs is Perona-Malik model that is a kindof anisotropic diusion (ANDI) lter. Anisotropic diusion lter has become a valuable tool indierent elds of image...

متن کامل

Reducing the Complexity of Genetic Fuzzy Classifiers in Highly-Dimensional Classification Problems

This paper introduces the Fast Iterative Rule-based Linguistic Classifier (FaIRLiC), a Genetic Fuzzy Rule-Based Classification System (GFRBCS) which targets at reducing the structural complexity of the resulting rule base, as well as its learning algorithm’s computational requirements, especially when dealing with high-dimensional feature spaces. The proposed methodology follows the principles ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998